Self-avoiding walks on diluted networks.

نویسندگان

  • Meir
  • Harris
چکیده

It is shown that, contrary to recent suggestions, the exponent ν, characterizing self-avoiding walks in a diluted lattice at the percolation threshold is determined by a fixed point, different from the pure-lattice one. The full phase diagram of this system is obtained by a real-space renormalization-group treatment and five nontrivial fixed points are identified. A field-theoretical treatment yields ν=1/2+ε/42, with ε=6-d. All these results are supported by exact enumeration analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : c on d - m at / 9 31 10 31 v 1 1 2 N ov 1 99 3 Statistics of self - avoiding walks on randomly diluted lattice

A comprehensive numerical study of self-avoiding walks (SAW’s) on randomly diluted lattices in two and three dimensions is carried out. The critical exponents ν and χ are calculated for various different occupation probabilities, disorder configuration ensembles, and walk weighting schemes. These results are analyzed and compared with those previously available. Various subtleties in the calcul...

متن کامل

High-dimensional graphical networks of self-avoiding walks

We use the lace expansion to analyse networks of mutually-avoiding self-avoiding walks, having the topology of a graph. The networks are defined in terms of spread-out self-avoiding walks that are permitted to take large steps. We study the asymptotic behaviour of networks in the limit of widely separated network branch points, and prove Gaussian behaviour for sufficiently spread-out networks o...

متن کامل

The lace expansion on a tree with application to networks of self-avoiding walks

The lace expansion has been used successfully to study the critical behaviour in high dimensions of self-avoiding walks, lattice trees and lattice animals, and percolation. In each case, the lace expansion has been an expansion along a time interval. In this paper, we introduce the lace expansion on a tree, in which ‘time’ is generalised from an interval to a tree. We develop the expansion in t...

متن کامل

Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices

We study self-avoiding and neighbour-avoiding walks and lattice trails on two semiregular lattices, the (3.122) lattice and the (4.82) lattice. For the (3.122) lattice we find the exact connective constant for both self-avoiding walks, neighbour-avoiding walks and trails. For the (4.82) lattice we generate long series which permit the accurate estimation of the connective constant for self-avoi...

متن کامل

Complex network classification using partially self-avoiding deterministic walks

Complex networks have attracted increasing interest from various fields of science. It has been demonstrated that each complex network model presents specific topological structures which characterize its connectivity and dynamics. Complex network classification relies on the use of representative measurements that describe topological structures. Although there are a large number of measuremen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review letters

دوره 63 26  شماره 

صفحات  -

تاریخ انتشار 1989